Linear Probing with Constant Independence

Linear Probing with 5-wise Independence

Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms for storing (key,value) pairs. In recent years it has become one of the most important hash table organizations since it uses the cache of modern computers very well. Unfortunately, previous analyses rely either on complicated and space consuming hash functions, or on the unrealistic assumption of free...

Probing fundamental constant evolution with astronomical spectroscopy

Validated Probing with Linear Relaxations

During branch and bound search in deterministic global optimization, adaptive subdivision is used to produce subregions x, which are then eliminated, shown to contain an optimal point, reduced in size, or further subdivided. The various techniques used to reduce or eliminate a subregion x determine the efficiency and practicality of the algorithm. Ryoo and Sahinidis have proposed a “probing” te...

Piecewise Constant Controlled Linear Fuzzy Systems

Algebraic Independence of Carlitz Zeta Values with Varying Constant Fields

As an analogue to special values at positive integers of the Riemann zeta function, for each constant field Fpr with fixed characteristic p we consider Carlitz zeta values ζr(n) at positive integers n. The main theorem of this paper asserts that among the families of Carlitz zeta values ∪∞ r=1 {ζr(1), ζr(2), ζr(3), . . . }, all the algebraic relations are those algebraic relations among each in...